Connection and Linearization Problems

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

مساله پوشش هاب تک تخصیصی بر روی شبکه ستاره‌ای؛ مدل‌بندی، خطی‌سازی و یافتن کران مناسب برای آن‌

The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...

متن کامل

The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited

As one of the seven open problems in the addendum to their 1989 book Computability in Analysis and Physics [21], Pour-El and Richards asked, “What is the connection between the computability of the original nonlinear operator and the linear operator which results from it?” Yet at present, systematic studies of the issues raised by this question seem to be missing from the literature. In this pa...

متن کامل

Free Vibration Analysis of Quintic Nonlinear Beams using Equivalent Linearization Method with a Weighted Averaging

In this paper, the equivalent linearization method with a weighted averaging proposed by Anh (2015) is applied to analyze the transverse vibration of quintic nonlinear Euler-Bernoulli beams subjected to axial loads. The proposed method does not require small parameter in the equation which is difficult to be found for nonlinear problems. The approximate solutions are harmonic oscillations, whic...

متن کامل

On linearization and connection coefficients for generalized Hermite polynomials

We consider the problem of finding explicit formulae, recurrence relations and sign properties for both connection and linearization coefficients for generalized Hermite polynomials. The most computations are carried out by the computer algebra system Maple using appropriate algorithms.

متن کامل

Comparing Two-Echelon and Single-Echelon Multi-Objective Capacitated Vehicle Routing Problems

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000